Density-Based Top-K Spatial Textual Clusters Retrieval
نویسندگان
چکیده
So-called spatial web queries retrieve content representing points of interest, such that the interest have descriptions are relevant to query keywords and located close a location. Two broad categories exist. The first encompasses single objects each satisfy arguments. Most proposals belong this category. second category, which paper's proposal belongs, support exploratory user behavior sets represent regions space may be user. Specifically, paper proposes new type query, top- $k$ textual cluster retrieval ( -STC) returns clusters (i) location, (ii) contain with regard given keywords, (iii) an object density exceeds threshold. To compute we propose DBSCAN-based approach OPTICS-based rely on on-line density-based clustering exploit early stop conditions. Empirical studies real data offer evidence can find good quality capable excellent performance.
منابع مشابه
Optimal Top-k Document Retrieval
Let D be a collection of D documents, which are strings over an alphabet of size σ, of total length n. We describe a data structure that uses linear space and and reports k most relevant documents that contain a query pattern P , which is a string of length p, in time O(p/ log σ n+k), which is optimal in the RAM model in the general case where lgD = Θ(logn), and involves a novel RAM-optimal suf...
متن کاملSpatial Textual Top-k Search in Mobile Peer-to-Peer Networks
Mobile hardware and software is quickly becoming the dominant computing model for technologically savvy people around the world. Nowadays, mobile devices are commonly equipped with GPS and wireless connections. Users have also developed the habit of regularly checking into a location, and adding comments or ratings for restaurants or any place of interest visited. This work explores new approac...
متن کاملSemantic-Based Top-k Retrieval for Competence Management
We present a knowledge-based system, for skills and talent management, exploiting semantic technologies combined with top-k retrieval techniques. The system provides advanced distinguishing features, including the possibility to formulate queries by expressing both strict requirements and preferences in the requested profile and a semantic-based ranking of retrieved candidates. Based on the kno...
متن کاملRelationship-Based Top-K Concept Retrieval for Ontology Search
With the recent growth of Linked Data on the Web there is an increased need for knowledge engineers to find ontologies to describe their data. Only limited work exists that addresses the problem of searching and ranking ontologies based on a given query term. In this paper we introduce DWRank, a two-staged bi-directional graph walk ranking algorithm for concepts in ontologies. DWRank characteri...
متن کاملRetrieving Top-k Prestige-Based Relevant Spatial Web Objects
The location-aware keyword query returns ranked objects that are near a query location and that have textual descriptions that match query keywords. This query occurs inherently in many types of mobile and traditional web services and applications, e.g., Yellow Pages and Maps services. Previous work considers the potential results of such a query as being independent when ranking them. However,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Knowledge and Data Engineering
سال: 2022
ISSN: ['1558-2191', '1041-4347', '2326-3865']
DOI: https://doi.org/10.1109/tkde.2021.3049785